Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme
نویسندگان
چکیده
منابع مشابه
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme
We give a polynomial-time approximation scheme for the generalization of Huffman coding in which codeword letters have nonuniform costs (as in Morse code, where the dash is twice as long as the dot). The algorithm computes a (1 + )-approximate solution in time O(n+ f( ) log n), where n is the input size.
متن کاملST - T C SC - 2 00 2 - 02 Huffman Coding with Unequal Letter Costs [ Extended
In the standard Huffman coding problem, one is given a set of words and for each word a positive frequency. The goal is to encode each word w as a codeword c(w) over a given alphabet. The encoding must be prefix free (no codeword is a prefix of any other) and should minimize the weighted average codeword size ∑ w freq(w) |c(w)|. The problem has a well-known polynomial-time algorithm due to Huff...
متن کاملMakespan Minimization in Job Shops: A Linear Time Approximation Scheme
In this paper we present a linear time approximation scheme for the job shop scheduling problem with fixed number of machines and fixed number of operations per job. This improves on the previously best 2 + ǫ, ǫ > 0, approximation algorithm for the problem by Shmoys, Stein, and Wein. Our approximation scheme is very general and it can be extended to the case of job shop scheduling problems with...
متن کاملA linear time approximation scheme for job shopscheduling ?
In this paper we present a linear time approximation scheme for the non-preemptive job shop scheduling problem when the number of machines and the number of operations per job are xed. We also show how to extend the approximation scheme for the preemptive version of the problem. Let p max = max ij p ij denote the maximum processing time of any operation. Let max = max 1im P j;kjmkj=i p kj be th...
متن کاملAn efficient test vector compression scheme using selective Huffman coding
This paper presents a compression/decompression scheme based on selective Huffman coding for reducing the amount of test data that must be stored on a tester and transferred to each core in a system-on-a-chip (SOC) during manufacturing test. The test data bandwidth between the tester and the SOC is a bottleneck that can result in long test times when testing complex SOCs that contain many cores...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2012
ISSN: 0097-5397,1095-7111
DOI: 10.1137/100794092